0.11/0.21	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.21	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.45	% Computer   : n012.cluster.edu
0.12/0.45	% Model      : x86_64 x86_64
0.12/0.45	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.45	% Memory     : 8042.1875MB
0.12/0.45	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.45	% CPULimit   : 1200
0.12/0.45	% WCLimit    : 120
0.12/0.45	% DateTime   : Tue Jul 13 12:13:32 EDT 2021
0.12/0.45	% CPUTime    : 
0.18/0.46	% Number of cores: 8
0.18/0.46	% Python version: Python 3.6.8
0.18/0.46	# Version: 2.6rc1-ho
0.18/0.46	# No SInE strategy applied
0.18/0.46	# Trying AutoSched0 for 59 seconds
0.18/0.50	# AutoSched0-Mode selected heuristic G_E___092_C01_F1_PI_AE_Q4_CS_SP_PS_S0Y
0.18/0.50	# and selection function SelectMaxLComplexAvoidPosPred.
0.18/0.50	#
0.18/0.50	# Preprocessing time       : 0.029 s
0.18/0.50	# Presaturation interreduction done
0.18/0.50	
0.18/0.50	# Proof found!
0.18/0.50	# SZS status Theorem
0.18/0.50	# SZS output start CNFRefutation
0.18/0.50	thf(cTHM567_pme, conjecture, ((![X1:(b > $o) > $o]:(![X2:b > $o]:(cQ @ X2<=X1 @ X2)=>cQ @ (^[X3:b]:![X4:b > $o]:(X4 @ X3<=X1 @ X4)))&![X1:(b > $o) > $o]:(cP @ (^[X5:b]:![X4:b > $o]:(X1 @ X4=>X4 @ X5))<=![X2:b > $o]:(X1 @ X2=>cP @ X2)))=>![X1:(b > $o) > $o]:((cQ @ (^[X6:b]:![X4:b > $o]:(X1 @ X4=>X4 @ X6))&cP @ (^[X7:b]:![X4:b > $o]:(X4 @ X7<=X1 @ X4)))<=![X2:b > $o]:((cP @ X2&cQ @ X2)<=X1 @ X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM567_pme)).
0.18/0.50	thf(c_0_1, plain, ![X3:b, X1:(b > $o) > $o]:(epred1_2 @ X1 @ X3<=>![X4:b > $o]:(X1 @ X4=>X4 @ X3)), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.18/0.50	thf(c_0_2, plain, ![X5:b, X1:(b > $o) > $o]:(epred2_2 @ X1 @ X5<=>![X4:b > $o]:(X1 @ X4=>X4 @ X5)), introduced(definition)).
0.18/0.50	thf(c_0_3, negated_conjecture, ~(((![X1:(b > $o) > $o]:(![X2:b > $o]:(X1 @ X2=>cQ @ X2)=>cQ @ (epred1_2 @ X1))&![X1:(b > $o) > $o]:(![X2:b > $o]:(X1 @ X2=>cP @ X2)=>cP @ (epred2_2 @ X1)))=>![X1:(b > $o) > $o]:(![X2:b > $o]:(X1 @ X2=>(cP @ X2&cQ @ X2))=>(cQ @ (epred2_2 @ X1)&cP @ (epred1_2 @ X1))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM567_pme]), c_0_1]), c_0_2]), c_0_2]), c_0_1])])).
0.18/0.50	thf(c_0_4, negated_conjecture, ![X14:(b > $o) > $o, X16:(b > $o) > $o, X19:b > $o]:((((X14 @ (epred3_1 @ X14)|cQ @ (epred1_2 @ X14))&(~cQ @ (epred3_1 @ X14)|cQ @ (epred1_2 @ X14)))&((X16 @ (epred4_1 @ X16)|cP @ (epred2_2 @ X16))&(~cP @ (epred4_1 @ X16)|cP @ (epred2_2 @ X16))))&(((cP @ X19|~epred5_0 @ X19)&(cQ @ X19|~epred5_0 @ X19))&(~cQ @ (epred2_2 @ epred5_0)|~cP @ (epred1_2 @ epred5_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])).
0.18/0.50	thf(c_0_5, negated_conjecture, ![X2:b > $o]:(cQ @ X2|~epred5_0 @ X2), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_6, negated_conjecture, ![X1:(b > $o) > $o]:(X1 @ (epred3_1 @ X1)|cQ @ (epred1_2 @ X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_7, negated_conjecture, ![X1:(b > $o) > $o]:(cQ @ (epred1_2 @ X1)|~cQ @ (epred3_1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_8, negated_conjecture, (~cQ @ (epred2_2 @ epred5_0)|~cP @ (epred1_2 @ epred5_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_9, negated_conjecture, cQ @ (epred1_2 @ epred5_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.18/0.50	thf(c_0_10, negated_conjecture, ![X2:b > $o]:(cP @ X2|~epred5_0 @ X2), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_11, negated_conjecture, ![X1:(b > $o) > $o]:(X1 @ (epred4_1 @ X1)|cP @ (epred2_2 @ X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_12, negated_conjecture, ![X1:(b > $o) > $o]:(cP @ (epred2_2 @ X1)|~cP @ (epred4_1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.18/0.50	thf(c_0_13, plain, ((epred1_2 @ epred5_0)!=(epred2_2 @ epred5_0)|~cP @ (epred1_2 @ epred5_0)), inference(ext_sup,[status(thm)],[c_0_8, c_0_9])).
0.18/0.50	thf(c_0_14, negated_conjecture, cP @ (epred2_2 @ epred5_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
0.18/0.50	thf(c_0_15, plain, (epred1_2 @ epred5_0)!=(epred2_2 @ epred5_0), inference(ext_sup,[status(thm)],[c_0_13, c_0_14])).
0.18/0.50	thf(c_0_16, plain, ![X20:b, X21:(b > $o) > $o, X22:b > $o, X23:b, X24:(b > $o) > $o]:((~epred1_2 @ X21 @ X20|(~X21 @ X22|X22 @ X20))&((X24 @ (epred6_2 @ X23 @ X24)|epred1_2 @ X24 @ X23)&(~epred6_2 @ X23 @ X24 @ X23|epred1_2 @ X24 @ X23))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.18/0.50	thf(c_0_17, plain, (epred1_2 @ epred5_0 @ esk14_0)!=(epred2_2 @ epred5_0 @ esk14_0), inference(neg_ext,[status(thm)],[c_0_15])).
0.18/0.50	thf(c_0_18, plain, ![X26:b, X27:(b > $o) > $o, X28:b > $o, X29:b, X30:(b > $o) > $o]:((~epred2_2 @ X27 @ X26|(~X27 @ X28|X28 @ X26))&((X30 @ (epred7_2 @ X29 @ X30)|epred2_2 @ X30 @ X29)&(~epred7_2 @ X29 @ X30 @ X29|epred2_2 @ X30 @ X29))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])).
0.18/0.50	thf(c_0_19, plain, ![X1:(b > $o) > $o, X3:b, X2:b > $o]:(X2 @ X3|~epred1_2 @ X1 @ X3|~X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_16])).
0.18/0.50	thf(c_0_20, plain, (epred2_2 @ epred5_0 @ esk14_0|epred1_2 @ epred5_0 @ esk14_0), inference(dynamic cnf,[status(thm)],[c_0_17])).
0.18/0.50	thf(c_0_21, plain, ![X1:(b > $o) > $o, X3:b, X2:b > $o]:(X2 @ X3|~epred2_2 @ X1 @ X3|~X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_18])).
0.18/0.50	thf(c_0_22, plain, ![X2:b > $o]:(X2 @ esk14_0|~epred5_0 @ X2), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])).
0.18/0.50	thf(c_0_23, plain, ![X1:(b > $o) > $o, X3:b]:(X1 @ (epred7_2 @ X3 @ X1)|epred2_2 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_18])).
0.18/0.50	thf(c_0_24, plain, ![X1:(b > $o) > $o, X3:b]:(epred2_2 @ X1 @ X3|~epred7_2 @ X3 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_18])).
0.18/0.50	thf(c_0_25, plain, ![X3:b]:(epred7_2 @ X3 @ epred5_0 @ esk14_0|epred2_2 @ epred5_0 @ X3), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.18/0.50	thf(c_0_26, plain, ![X1:(b > $o) > $o, X3:b]:(X1 @ (epred6_2 @ X3 @ X1)|epred1_2 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_16])).
0.18/0.50	thf(c_0_27, plain, (~epred1_2 @ epred5_0 @ esk14_0|~epred2_2 @ epred5_0 @ esk14_0), inference(dynamic cnf,[status(thm)],[c_0_17])).
0.18/0.50	thf(c_0_28, plain, epred2_2 @ epred5_0 @ esk14_0, inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.18/0.50	thf(c_0_29, plain, ![X1:(b > $o) > $o, X3:b]:(epred1_2 @ X1 @ X3|~epred6_2 @ X3 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_16])).
0.18/0.50	thf(c_0_30, plain, ![X3:b]:(epred6_2 @ X3 @ epred5_0 @ esk14_0|epred1_2 @ epred5_0 @ X3), inference(spm,[status(thm)],[c_0_22, c_0_26])).
0.18/0.50	thf(c_0_31, plain, ~epred1_2 @ epred5_0 @ esk14_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
0.18/0.50	thf(c_0_32, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31]), ['proof']).
0.18/0.50	# SZS output end CNFRefutation
0.18/0.50	# Proof object total steps             : 33
0.18/0.50	# Proof object clause steps            : 26
0.18/0.50	# Proof object formula steps           : 7
0.18/0.50	# Proof object conjectures             : 12
0.18/0.50	# Proof object clause conjectures      : 9
0.18/0.50	# Proof object formula conjectures     : 3
0.18/0.50	# Proof object initial clauses used    : 13
0.18/0.50	# Proof object initial formulas used   : 1
0.18/0.50	# Proof object generating inferences   : 7
0.18/0.50	# Proof object simplifying inferences  : 6
0.18/0.50	# Training examples: 0 positive, 0 negative
0.18/0.50	# Parsed axioms                        : 4
0.18/0.50	# Removed by relevancy pruning/SinE    : 0
0.18/0.50	# Initial clauses                      : 16
0.18/0.50	# Removed in clause preprocessing      : 3
0.18/0.50	# Initial clauses in saturation        : 13
0.18/0.50	# Processed clauses                    : 98
0.18/0.50	# ...of these trivial                  : 9
0.18/0.50	# ...subsumed                          : 12
0.18/0.50	# ...remaining for further processing  : 77
0.18/0.50	# Other redundant clauses eliminated   : 0
0.18/0.50	# Clauses deleted for lack of memory   : 0
0.18/0.50	# Backward-subsumed                    : 1
0.18/0.50	# Backward-rewritten                   : 3
0.18/0.50	# Generated clauses                    : 508
0.18/0.50	# ...of the previous two non-trivial   : 257
0.18/0.50	# Contextual simplify-reflections      : 3
0.18/0.50	# Paramodulations                      : 28
0.18/0.50	# Factorizations                       : 0
0.18/0.50	# NegExts                              : 32
0.18/0.50	# Equation resolutions                 : 0
0.18/0.50	# Propositional unsat checks           : 0
0.18/0.50	#    Propositional check models        : 0
0.18/0.50	#    Propositional check unsatisfiable : 0
0.18/0.50	#    Propositional clauses             : 0
0.18/0.50	#    Propositional clauses after purity: 0
0.18/0.50	#    Propositional unsat core size     : 0
0.18/0.50	#    Propositional preprocessing time  : 0.000
0.18/0.50	#    Propositional encoding time       : 0.000
0.18/0.50	#    Propositional solver time         : 0.000
0.18/0.50	#    Success case prop preproc time    : 0.000
0.18/0.50	#    Success case prop encoding time   : 0.000
0.18/0.50	#    Success case prop solver time     : 0.000
0.18/0.50	# Current number of processed clauses  : 52
0.18/0.50	#    Positive orientable unit clauses  : 5
0.18/0.50	#    Positive unorientable unit clauses: 0
0.18/0.50	#    Negative unit clauses             : 2
0.18/0.50	#    Non-unit-clauses                  : 45
0.18/0.50	# Current number of unprocessed clauses: 185
0.18/0.50	# ...number of literals in the above   : 711
0.18/0.50	# Current number of archived formulas  : 0
0.18/0.50	# Current number of archived clauses   : 25
0.18/0.50	# Clause-clause subsumption calls (NU) : 193
0.18/0.50	# Rec. Clause-clause subsumption calls : 158
0.18/0.50	# Non-unit clause-clause subsumptions  : 9
0.18/0.50	# Unit Clause-clause subsumption calls : 29
0.18/0.50	# Rewrite failures with RHS unbound    : 0
0.18/0.50	# BW rewrite match attempts            : 3
0.18/0.50	# BW rewrite match successes           : 3
0.18/0.50	# Condensation attempts                : 0
0.18/0.50	# Condensation successes               : 0
0.18/0.50	# Termbank termtop insertions          : 4479
0.18/0.50	
0.18/0.50	# -------------------------------------------------
0.18/0.50	# User time                : 0.033 s
0.18/0.50	# System time              : 0.007 s
0.18/0.50	# Total time               : 0.041 s
0.18/0.50	# Maximum resident set size: 1648 pages
0.18/0.50	EOF